An exact exponential time algorithm for counting bipartite cliques
نویسنده
چکیده
We present a simple exact algorithm for counting bicliques of given size in a bipartite graph on n vertices. We achieve running time of O(1.2491), improving upon known exact algorithms for finding and counting bipartite cliques.
منابع مشابه
Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In
Exact exponential-time algorithms for NP-hard problems is an emerging field, and an increasing number of new results are being added continuously. Two important NP-hard problems that have been studied for decades are the treewidth and the minimum fill problems. Recently, an exact algorithm was presented by Fomin, Kratsch, and Todinca to solve both of these problems in time O∗(1.9601n). Their al...
متن کاملCounting perfect matchings as fast as Ryser
We show that there is a polynomial space algorithm that counts the number of perfect matchings in an n-vertex graph in O(2) ⊂ O(1.415) time. (O∗(f(n)) suppresses functions polylogarithmic in f(n)).The previously fastest algorithms for the problem was the exponential space O∗(((1 + √ 5)/2)) ⊂ O(1.619) time algorithm by Koivisto, and for polynomial space, the O(1.942) time algorithm by Nederlof. ...
متن کاملA counterexample to rapid mixing of the Ge - Štefankovič process ∗ Leslie
Ge and Štefankovič have recently introduced a Markov chain which, if rapidly mixing, would provide an efficient procedure for sampling independent sets in a bipartite graph. Such a procedure would be a breakthrough because it would give an efficient randomised algorithm for approximately counting independent sets in a bipartite graph, which would in turn imply the existence of efficient approxi...
متن کاملComputing Branchwidth Via Efficient Triangulations and Blocks
Minimal triangulations and potential maximal cliques are the main ingredients for a number of polynomial time algorithms on different graph classes computing the treewidth of a graph. Potential maximal cliques are also the main engine of the fastest so far exact (exponential) treewidth algorithm. Based on the recent results of Mazoit, we define the structures that can be regarded as minimal tri...
متن کاملApproximating the Permanent of Graphs with Large Factors
Let G = (U; V; E) be a bipartite graph with jUj = jV j = n. The factor size of G, f, is the maximum number of edge disjoint perfect matchings in G. We characterize the complexity of counting the number of perfect match-ings in classes of graphs parameterized by factor size. We describe the simple algorithm, which is an approximation algorithm for the permanent that is a natural simpliication of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 112 شماره
صفحات -
تاریخ انتشار 2012